class Solution
{
public:
    int jewelleryValue(vector<vector<int>>& ob)
    {
        int m = ob.size(), n = ob[0].size();
        vector<vector<int>> dp(m + 1, vector<int>(n + 1));

        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= n; j++)
                dp[i][j] = max((dp[i - 1][j] + ob[i - 1][j - 1]), (dp[i][j - 1] + ob[i - 1][j - 1]));
        return dp[m][n];
    }
};